Optimization of Mobile Robotic Relay Operation for Minimal Average Wait Time
نویسندگان
چکیده
This paper considers trajectory planning for a mobile robot which persistently relays data between pairs of far-away communication nodes. Data accumulates stochastically at each source, and the must move to appropriate positions enable offload corresponding destination. The needs minimize average time that waits source before being serviced. We are interested in finding optimal robotic routing policies consisting 1) locations where stops relay (relay positions) 2) conditional transition probabilities determine sequence first pose this problem as non-convex optimizes over both probabilities. To find approximate solutions, we propose novel algorithm alternately For former, efficient convex partitions regions, then formulate mixed-integer second-order cone problem. latter, via sequential least squares programming. extensively analyze proposed approach mathematically characterize important system properties related robot’s long-term energy consumption service rate. Finally, through extensive simulation with real channel parameters, verify efficacy our approach.
منابع مشابه
Ant Colony Optimization for Co-operation in Robotic Swarms
The swarm robotic concept has become a topic of extensive research in hazardous environments where a fault tolerant, robust and energy efficient approach is needed. In this paper we present behavior based algorithm for target navigation and swarm distribution over hazardous targets. This work is inspired by ant colony models. Our goal is to derive a heuristic algorithm for target localization a...
متن کاملMinimal Operation Time of Energy Devices
We consider the problem of determining the minimal time for which an energy supply source should operate in order to supply a system with a desired amount of energy in finite time.
متن کاملParallel Active Learning: Eliminating Wait Time with Minimal Staleness
A practical concern for Active Learning (AL) is the amount of time human experts must wait for the next instance to label. We propose a method for eliminating this wait time independent of specific learning and scoring algorithms by making scores always available for all instances, using old (stale) scores when necessary. The time during which the expert is annotating is used to train models an...
متن کاملCyclic production for the robotic balanced no-wait flow shop
Abstract. In a no-wait robotic flow-shop, the parts are transferred from a machine to another one by a robot and the time a part can remain on a machine is fixed. The objective is to maximize the throughput rate of the cell, i.e. to find optimal cyclic robot moves. In this paper, we consider identical parts in the balanced case (all processing times are equal). We present a conjecture which giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Wireless Communications
سال: 2023
ISSN: ['1536-1276', '1558-2248']
DOI: https://doi.org/10.1109/twc.2022.3220786